Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
نویسندگان
چکیده
منابع مشابه
Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints
Blazewicz, J., W. Kubiak and S. Martello, Algorithms for minimizing maximum lateness with unit length tasks and resource constraints, Discrete Applied Mathematics 42 (1993) 1233138. The problem we consider is that of scheduling n unit length tasks on identical processors in the presence of additional scarce resources. The objective is to minimize maximum lateness. It has been known for some tim...
متن کاملThe Optimal Online Algorithms for Minimizing Maximum Lateness
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arrive over time on a single machine to minimize maximum lateness. It was not previously known what other online algorithms are optimal for this problem. A complete characterization of all optimal online algorithms for th...
متن کاملWorking Paper Branch and Bound Algorithms for Minimizing Maximum Lateness of Trucks at a Transshipment Terminal
This paper focuses on the scheduling of trucks at a transshipment terminal with a single gate. Trucks deliver or pick up a single type of items at the gate and, therefore, increase or decrease, respectively, the inventory level. Naturally, pick up trucks can be served only if the required amount of items is available in the inventory. We consider the problem to find a schedule for trucks such t...
متن کاملJob Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines. The execution of any task on its corresponding machine takes exactly one time unit. The objective is to minimize the overall completion time, called makespan. The contribution of this paper are the following results: (i...
متن کاملMinimizing Maximum Lateness on Identical Parallel Batch Processing Machines
We consider the problem of scheduling n jobs with release dates on m identical parallel batch processing machines so as to minimize the maximum lateness. Each batch processing machine can process up to B (B < n) jobs simultaneously as a batch, and the processing time of a batch is the largest processing time among the jobs in the batch. Jobs processed in the same batch start and complete at the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90042-m